Blurred complex exponentiation
نویسنده
چکیده
I describe a way of blurring an exponential field in a way which preserves the natural closure operator. The results of blurring the complex exponential field and of blurring Zilber’s exponential field are isomorphic.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملThe complex numbers and complex exponentiation Why Infinitary Logic is necessary!
In this article we discuss some of the uses of model theory to investigate the structure of the field of complex numbers with exponentiation and associated algebraic groups. After a sketch of some background material on the use of first order model theory in algebra, we describe the inadequacy of the first order framework for studying complex exponentiation. Then, we discuss the Zilber’s progra...
متن کاملFast quantum modular exponentiation
concurrent architecture, NTC, neighbor-only, two-qubit gate, concurrent architecture; and Perf, performance relative to VBE algorithm for that architecture, based on CCNOTs for AC and CNOTs for NTC.
متن کاملA Note on the Axioms for Zilber's Pseudo-Exponential Fields
We show that Zilber’s conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the firstorder types in pseudo-exponentiation leads to a description of the elementary embeddings, and the result that pseudo-exponential fields are precisely the models of their common first-or...
متن کاملFast and Constant-Time Implementation of Modular Exponentiation
Modular exponentiation is an important operation which requires a vast amount of computations. Therefore, it is crucial to build fast exponentiation schemes. Since Cache and data-dependent branching behavior can alter the runtime of an algorithm significantly, it is also important to build an exponentiation scheme with constant run-time. However, such approaches have traditionally added signifi...
متن کامل